A Typed Functional Calculus with State
نویسنده
چکیده
We extend the simple typed calculus with statements A statement which can also be thought of as a method or transition is an abstraction similar to function abstraction it can be instantiated by providing it with a source state whereafter it yields a pair of values consisting of an output value and a target state We obtain a strongly normalising typed calculus for state based functional programming
منابع مشابه
Functional Programming Formalisms for OODBMS Methods
Two well-studied functional formalisms in the theory of programming languages are (1) applicative program schemas and (2) typed lambda calculi. We relate these programming formalisms to object-oriented databases (OODBs) and in particular to the description of methods. The language of method schemas (MS) is a programming formalism based on applicative program schemas with additional key object-o...
متن کاملFunctional Programming Formalisms for OODB Methods
Two well-studied functional formalisms in the theory of programming languages are (1) applicative program schemas and (2) typed lambda calculi. We relate these programming formalisms to object-oriented databases (OODBs) and in particular to the description of methods. The language of method schemas (MS) is a programming formalism based on applicative program schemas with additional key object-o...
متن کاملAlpha Conversion in Simply Typed Lambda Calculus
In the usual presentations of simply typed-calculus, it is usual to identify terms that are-convertible. However, this is not at all a practise in most (typed) functional languages, for which simply typed-calculus is a theoretical foundation. Here, ve well known variants of the type system for simply-calculus which work with variable names are presented. Essentially, these formulations diier in...
متن کاملUnder Consideration for Publication in J. Functional Programming Girard Translation and Logical Predicates
We present a short proof of a folklore result: the Girard translation from the simply typed lambda calculus to the linear lambda calculus is fully complete. The proof makes use of a notion of logical predicates for intuitionistic linear logic. While the main result is of independent interest, this paper can be read as a tutorial on this proof technique for reasoning about relations between type...
متن کاملStrong Normalisation in the π-Calculus
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed λ-calculi and linear lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997